Algorithms for polynomial spectral factorization and bounded-real balanced state space representations
نویسندگان
چکیده
We illustrate an algorithm that starting from the image representation of a strictly bounded-real system computes a minimal balanced state variable, from which a minimal balanced state realization is readily obtained. The algorithm stems from an iterative procedure to compute a storage function, based on a technique to solve a generalization of the Nevanlinna interpolation problem.
منابع مشابه
A decomposition based proof for fast mixing of a Markov chain over balanced realizations of a joint degree matrix
A joint degree matrix (JDM) specifies the number of connections between nodes of given degrees in a graph, for all degree pairs and uniquely determines the degree sequence of the graph. We consider the space of all balanced realizations of an arbitrary JDM, realizations in which the links between any two degree groups are placed as uniformly as possible. We prove that a swap Markov Chain Monte ...
متن کاملResidual Generation in Linear Stochastic Systems - A Polynomial Approach
A polynomial design algorithm for innovation/residual generation for fault diagnosis is given. The class of systems considered is linear stochastic state-space and descriptor systems in both continuous and discrete time. A new class of residual generators based on stochastic models is defined and design algorithms are derived. The algorithms is based on standard operations such as null-space co...
متن کاملNew Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملThe (J, J )–Spectral Factorization of a General Discrete–Time System
For a discrete–time system whose transfer matrix function is completely general (arbitrary normal rank, strictly proper/imprope/polynomial, with poles and zeroes on the unit circle) we give existence conditions and constructive formulas for the (J, J ′)–spectral factor. The computation of the spectral factor is done by employing generalized state–space realizations and numerically–sound algorit...
متن کاملتعیین ماشین‌های بردار پشتیبان بهینه در طبقه‌بندی تصاویر فرا طیفی بر مبنای الگوریتم ژنتیک
Hyper spectral remote sensing imagery, due to its rich source of spectral information provides an efficient tool for ground classifications in complex geographical areas with similar classes. Referring to robustness of Support Vector Machines (SVMs) in high dimensional space, they are efficient tool for classification of hyper spectral imagery. However, there are two optimization issues which s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- MCSS
دوره 25 شماره
صفحات -
تاریخ انتشار 2013